An EA Multi-model Selection for SVM Multiclass Schemes

نویسندگان

  • Gilles Lebrun
  • Olivier Lézoray
  • Christophe Charrier
  • Hubert Cardot
چکیده

Multiclass problems with binary SVM classifiers are commonly treated as a decomposition in several binary sub-problems. An open question is how to properly tune all these sub-problems (SVM hyperparameters) in order to have the lowest error rate for a SVM multiclass scheme based on decomposition. In this paper, we propose a new approach to optimize the generalization capacity of such SVM multiclass schemes. This approach consists in a global selection of hyperparameters for sub-problems all together and it is denoted as multi-model selection. A multi-model selection can outperform the classical individual model selection used until now in the literature. An evolutionary algorithm (EA) is proposed to perform multi-model selection. Experimentations with our EA method show the benefits of our approach over the classical one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EA Multi-Model Selection for SVM

Evolutionary algorithms (EA) (Rechenberg, 1965) belong to a family of stochastic search algorithms inspired by natural evolution. In the last years, EA were used successfully to produce efficient solutions for a great number of hard optimization problems (Beasley, 1997). These algorithms operate on a population of potential solutions and apply a survival principle according to a fitness measure...

متن کامل

Individual feature selection in each One-versus-One classifier improves multi-class SVM performance

Multiclass One-versus-One (OvO) SVM, which is constructed by assembling a group of binary classifiers, is usually treated as a black-box. The usual Multiclass Feature Selection (MFS) algorithm chooses an identical subset of features for every OvO SVM. We question whether the standard process of applying feature selection and then constructing the multiclass classifier is best. We propose that I...

متن کامل

Universum Learning for Multiclass SVM

We introduce Universum learning [1], [2] for multiclass problems and propose a novel formulation for multiclass universum SVM (MU-SVM). We also propose a span bound for MU-SVM that can be used for model selection thereby avoiding resampling. Empirical results demonstrate the effectiveness of MU-SVM and the proposed bound.

متن کامل

Multiclass SVM-RFE for product form feature selection

Various form features affect consumer preference regarding product design. It is, therefore, important that designers identify these critical form features to aid them in developing appealing products. However, the problems inherent in choosing product form features have not yet been intensively investigated. In this paper, an approach based on multiclass support vector machine recursive featur...

متن کامل

A Comparison of SVM-based Evolutionary Methods for Multicategory Cancer Diagnosis using Microarray Gene Expression Data

Selection of relevant genes that will give higher accuracy for sample classification (for example, to distinguish cancerous from normal tissues) is a common task in most microarray data studies. An evolutionary method based on generalization error bound theory of support vector machine (SVM) can select a subset of potentially informative genes for SVM classifier very efficiently. The bound theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007